IMPLEMENTATION OF SIMULTANEOUS MEMORY ADDRESS ACCESS IN MODELS THAT FORBID ITVISHKIN U.1983; JOURNAL OF ALGORITHMS; ISSN 0196-6774; USA; DA. 1983; VOL. 4; NO 1; PP. 45-50; BIBL. 19 REF.Article

Can parallel algorithms enhance serial implementation ?VISHKIN, U.Communications of the ACM. 1996, Vol 39, Num 9, pp 89-91, issn 0001-0782Article

A parallel-design distributed-implementation (PDDI) general-purpose computerVISHKIN, U.Theoretical computer science. 1984, Vol 32, Num 1-2, pp 157-172, issn 0304-3975Article

FINDING THE MAXIMUM, MERGING AND SORTING IN A PARALLEL COMPUTATION MODELSHILOACH Y; VISHKIN U.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 111; PP. 314-327; BIBL. 16 REF.Conference Paper

Deterministic sampling ― a new technique for fast pattern matchingVISHKIN, U.SIAM journal on computing (Print). 1991, Vol 20, Num 1, pp 22-40, issn 0097-5397, 19 p.Article

AN O(N² LOG N) PARALLEL MAX-FLOW ALGORITHMSHILOACH Y; VISHKIN U.1982; JOURNAL OF ALGORITHMS; ISSN 0196-6774; USA; DA. 1982; VOL. 3; NO 2; PP. 128-146; BIBL. 23 REF.Article

On efficient parallel strong orientationVISHKIN, U.Information processing letters. 1985, Vol 20, Num 5, pp 235-240, issn 0020-0190Article

An optimal parallel connectivity algorithmVISHKIN, U.Discrete applied mathematics. 1984, Vol 9, Num 2, pp 197-207, issn 0166-218XArticle

AN O(LOG N) PARALLEL CONNECTIVITY ALGORITHMSHILOACH Y; VISHKIN U.1982; J. ALGORITHMS; ISSN 0196-6774; USA; DA. 1982; VOL. 3; NO 1; PP. 57-67; BIBL. 4 REF.Article

COMPLEXITY OF FINDING K-PATH-FREE DOMINATING SETS IN GRAPHSBAR YEHUDA R; VISHKIN U.1982; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1982; VOL. 14; NO 5; PP. 228-232; BIBL. 8 REF.Article

GOLDEN RATIOS IN A PAIRS COVERING PROBLEMSHILOACH Y; VISHKIN U; ZAKS S et al.1982; DISCRETE MATH.; ISSN 0012-365X; NLD; DA. 1982; VOL. 41; NO 1; PP. 57-65; BIBL. 2 REF.Article

Recursive star-tree parallel data structureBERKMAN, O; VISHKIN, U.SIAM journal on computing (Print). 1993, Vol 22, Num 2, pp 221-242, issn 0097-5397Article

Almost fully-parallel parentheses matchingBERKMAN, O; VISHKIN, U.Discrete applied mathematics. 1995, Vol 57, Num 1, pp 11-28, issn 0166-218XArticle

Biconnectivity approximations and graph carvingsKHULLER, S; VISHKIN, U.Journal of the Association for Computing Machinery. 1994, Vol 41, Num 2, pp 214-235, issn 0004-5411Article

Finding level-ancestors in treesBERKMAN, O; VISHKIN, U.Journal of computer and system sciences (Print). 1994, Vol 48, Num 2, pp 214-230, issn 0022-0000Article

Approximate parallel scheduling. II, Applications to logarithmic-time optimal parallel graph algorithmsCOLE, R; VISHKIN, U.Information and computation (Print). 1991, Vol 92, Num 1, pp 1-47, issn 0890-5401, 47 p.Article

Tight comparison bounds on the complexity of parallelsortingAZAR, Y; VISHKIN, U.SIAM journal on computing (Print). 1987, Vol 16, Num 3, pp 458-464, issn 0097-5397Article

Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memoriesMEHLHORN, K; VISHKIN, U.Acta informatica. 1984, Vol 21, Num 4, pp 339-374, issn 0001-5903Article

Solving NP-hard problems in almost trees: vertex coverCOPPERSMITH, D; VISHKIN, U.Discrete applied mathematics. 1985, Vol 10, Num 1, pp 27-45, issn 0166-218XArticle

Trade-offs between depth and width in parallel computationVISHKIN, U; WIGDERSON, A.SIAM journal on computing (Print). 1985, Vol 14, Num 2, pp 303-314, issn 0097-5397Article

On the detection of robust curvesCOLE, R; VISHKIN, U.CVGIP. Graphical models and image processing. 1994, Vol 56, Num 3, pp 189-204, issn 1049-9652Article

On the parallel complexity of digraph reachabilityKHULLER, S; VISHKIN, U.Information processing letters. 1994, Vol 52, Num 5, pp 239-241, issn 0020-0190Article

Faster optimal parallel prefix sums and list rankingCOLE, R; VISHKIN, U.Information and computation (Print). 1989, Vol 81, Num 3, pp 334-352, issn 0890-5401Article

Deterministic coin tossing with applications to optimal parallel list rankingCOLE, R; VISHKIN, U.Information and control. 1986, Vol 70, Num 1, pp 32-53, issn 0019-9958Article

Efficient string matching with k mismatchesLANDAU, G. M; VISHKIN, U.Theoretical computer science. 1986, Vol 43, Num 2-3, pp 239-249, issn 0304-3975Article